The outcome range problem in interval linear programming

Optimal value range in interval linear programming

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

First step immersion in interval linear programming with linear dependencies

‎We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals‎. ‎Contrary to classical models‎, ‎where parameters can attain any value from the interval domains independently‎, ‎we study problems with linear dependencies between the parameters‎. ‎We present a class of problems that are easily solved by reduction to the classi...

A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints

Most research on bilevel linear programming problem  is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...

Linear Interval Tolerance Problem and Linear Programming Techniques

In this paper, we consider the linear interval tolerance problem, which consists of finding the largest interval vector included in Σ∀,∃([A], [b]) = {x ∈R | ∀A ∈ [A], ∃b ∈ [b], Ax = b}. We describe two different polyhedrons that represent subsets of all possible interval vectors inΣ∀,∃([A], [b]), and we provide a new definition of the optimality of an interval vector included in Σ∀,∃([A], [b])....